Semistrong edge coloring of graphs
نویسندگان
چکیده
Weakening the notion of a strong (induced) matching of graphs, in this paper, we introduce the notion of a semistrong matching. A matching M of a graph G is called semistrong if each edge of M has a vertex, which is of degree one in the induced subgraph G1⁄2M . We strengthen earlier results by showing that for the subset graphs and for the Kneser graphs the sizes of the maxima of the strong and semistrong matchings are equal and so are the strong and semistrong chromatic indices. Similar properties are conjectured for the n-dimensional cube. 2005 Wiley Periodicals, Inc. J Graph Theory 49: 39–47, 2005
منابع مشابه
Edge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملOn the Edge-Difference and Edge-Sum Chromatic Sum of the Simple Graphs
For a coloring $c$ of a graph $G$, the edge-difference coloring sum and edge-sum coloring sum with respect to the coloring $c$ are respectively $sum_c D(G)=sum |c(a)-c(b)|$ and $sum_s S(G)=sum (c(a)+c(b))$, where the summations are taken over all edges $abin E(G)$. The edge-difference chromatic sum, denoted by $sum D(G)$, and the edge-sum chromatic sum, denoted by $sum S(G)$, a...
متن کاملGroup connectivity of semistrong product of graphs
For a 2-edge-connected graph G, the group connectivity number of G is defined as Λg(G) = min{k : G is A-connected for every abelian group with |A| ≥ k}. Let G •H denote the semistrong product of two graphs G and H. In this paper, we extend the result of Yan et al. [Int. J. Algebra 4 (2010), 1185–1200] on group connectivity in Cartesian product of graphs to semistrong products and make a slightl...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملFractional Q-edge-coloring of Graphs
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let Q be an additive hereditary property of graphs. A Q-edge-coloring of a simple graph is an edge coloring in which the edges colored with the same color induce a subgraph of property Q. In this paper we present some results on fractional Q-edge-colorings. We determine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2005